An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs
نویسندگان
چکیده
Static global analyses based on abstract interpretation have been used to derive properties of programs. The analyses differ in the expressiveness of the abstract domains and the precision and efficiency of domain operations. We extend an abstract domain defined by Jacobs and Langen and present new abstract domain operations to derive freeness, groundness, and sharing of variables in logic programs. Analysis of non-trivial programs shows that our method is more precise and more efficient than previous proposals.
منابع مشابه
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation
y Abstract. Recently, a technique was presented for using pre-interpretations for abstract interpretation of the correct answer set CP of a logic program P. So far it was an open problem whether pre-interpretations could also be used for deriving non-downward closed properties of the computed answer set OP such as deenite freeness. This paper shows that it is possible to do so.
متن کاملNon-strict independence-based program parallelization using sharing and freeness information
The current ubiquity of multi-core processors has brought renewed interest in program parallelization. Logic programs allow studying the parallelization of programs with complex, dynamic data structures with (declarative) pointers in a comparatively simple semantic setting. In this context, automatic parallelizers which exploit and-parallelism rely on notions of independence in order to ensure ...
متن کاملFreeness Analysis in the Presence of Numerical Constraints
This paper describes a novel application of abstract interpretation dealing with mixed systems of numerical and unification constraints. In general, the abstraction of such systems cannot be separated into two independent parts, since a program variable is often involved in both types of constraints. The proposed abstraction deals in an elegant way with the interaction between the two types of ...
متن کاملFreeness Analysis for Logic Programs - And Correctness?
Several proposals for computing freeness information for logic. programs ha.ve been put forward in recent literature. The availability of such information has proven useful in a variety of applications, including parallelization of Prolog programs, optimizations in Prolog compilers, as well as for improving the precision of other analyses. While these proposals have illustrated the importance o...
متن کاملTowards Verification of Java Bytecode using Logic Programming Tools
State of the art analyzers in the (Constraint) Logic Programming paradigm (or (C)LP for short) are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, run-time error freeness, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verificatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992